Finite Population Effects for Ranking and Tournament Selection
نویسنده
چکیده
The effect of ranking and binary tournament selection on the distribution of fitnesses and genetic correlation is calculated for a finite population. The results are different for continuous and discrete fitness functions. Results for both situations are obtained. These exact results are compared to a previously obtained approximation up to the third cumulant and shown to be in good agreement. Tournament and ranking selection are compared with Boltzmann selection for which exact finite population effects are already known.
منابع مشابه
Complex Coevolutionary Dynamics - Structural Stability and Finite Population Effects
Unlike evolutionary dynamics, co-evolutionary dynamics can exhibit a wide variety of complex regimes. This has been confirmed by numerical studies e.g. in the context of Evolutionary Game Theory (EGT) and population dynamics of simple two-strategy games with various types of replication and selection mechanisms. Using the framework of shadowing lemma we study to what degree can such infinite po...
متن کاملModeling Alternate Selection Schemes For Genetic Algorithms
Beginning with a representational framework of which genetic algorithms are a special case, the ranking and tournament selection schemes are defined and formalized as mathematical functions. The main result is that ranking and tournament selection are diffeomorphisms of the representation space. Explicit algorithms are also developed for computing their inverses.
متن کاملCalculating the Expected Loss of Diversity of Selection Schemes
This paper concerns a measure of selective pressure, called "loss of diversity," that denotes the proportion of unselected individuals during the selection phase. We probabilistically calculate the expected value and variance of loss of diversity in tournament selection, truncation selection, linear ranking selection, and exponential ranking selection. From numerical results, we observe that in...
متن کاملDifferentiable coarse graining
Coarse graining is defined in terms of a commutative diagram. Necessary and sufficient conditions are given in the continuously differentiable case. The theory is applied to linear coarse grainings arising from partitioning the population space of a simple Genetic Algorithm (GA). Cases considered include proportional selection, binary tournament selection, ranking selection, and mutation. A non...
متن کاملA Comparison of Selection Schemes used in Genetic Algorithms
Genetic Algorithms are a common probabilistic optimization method based on the model of natural evolution. One important operator in these algorithms is the selection scheme for which a new description model is introduced in this paper. With this a mathematical analysis of tournament selection, truncation selection, linear and exponential ranking selection and proportional selection is carried ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Complex Systems
دوره 12 شماره
صفحات -
تاریخ انتشار 2000